Tightish Bounds on Davenport-Schinzel Sequences
نویسنده
چکیده
Let Ψs(n) be the extremal function of order-s Davenport-Schinzel sequences over an n-letter alphabet. Together with existing bounds due to Hart and Sharir (s = 3), Agarwal, Sharir, and Shor (s = 4, lower bounds on s ≥ 6), and Nivasch (upper bounds on even s), we give the following essentially tight bounds on Ψs(n) for all s: Ψs(n) = n s = 1
منابع مشابه
Three Generalizations of Davenport-Schinzel Sequences
We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-s double DS sequences, for all s, sharp bounds on sequences avoiding catenated permutations (aka formation free sequences), and new lower bounds on sequences avoiding zig-zagging patterns.
متن کاملExtremal functions for sequences
Davenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate repetition and with no alternating subsequence (i.e. of the type ababab . . .) of the length s. This concept based on a geometrical motivation is due to Davenport and Schinzel in the middle of sixties. In the late eighties strong lower and upper (superlinear) bounds on the maximum length of the DS(s) seque...
متن کاملExtremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generally applicable theorem, the n log n upper bound on the ordered graph extremal function of F = ({1, 3}, {1, 5}, {2, 3}, {2, 4}) due to Füredi to the n(log n)2(log log n)3 upper bound in the hypergraph case. We use Davenp...
متن کاملGeneralized Davenport–Schinzel sequences: results, problems, and applications
We survey in detail extremal results on Davenport–Schinzel sequences and their generalizations, from the seminal papers of H. Davenport and A. Schinzel in 1965 to present. We discuss geometric and enumerative applications, generalizations to colored trees, and generalizations to hypergraphs. Eleven illustrative examples with proofs are given and nineteen open problems are posed.
متن کاملDavenport-Schinzel sequences and their geometric applications
An (n; s) Davenport{Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation a b a b of length s + 2 between two distinct symbols a and b. The close relationship between Davenport{Schinzel sequences and the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1204.1086 شماره
صفحات -
تاریخ انتشار 2012